// url:https://codeforces.com/contest/685/problem/C
// time:2022-04-02 06:39:27
// name:C-OptimalPoint

// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
// mt19937 mrand(random_device{}());
// int rnd(int x) { return mrand() % x; }
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
int lg2(int64 x) { return sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int cas;
  cin >> cas;
  while (cas--) {
    int n;
    cin >> n;
    vector<array<int64, 3>> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i][0] >> a[i][1] >> a[i][2];

    int64 low = 0, high = 3e18 + 10;
    vector<int64> ret(3);
    while (low != high) {
      int64 mid = (low + high) / 2;
      bool ok = 1;
      vector<int64> mn(4, inf<int64>);
      vector<int64> mx(4, -inf<int64>);
      for (int k = 0; k < 4; ++k) {
        for (int i = 0; i < n; ++i) {
          int64 c = a[i][0] + a[i][1] + a[i][2];
          if (k < 3) c -= 2 * a[i][k];
          // [c - mid, c + mid]
          ckmax(mx[k], c - mid);
          ckmin(mn[k], c + mid);
        }
        if (mx[k] > mn[k]) {
          ok = 0;
          break;
        }
      }
      if (ok) {
        bool found = 0;
        for (int r = 0; r < 2; ++r) {
          vector<int64> L(4), R(4);
          for (int k = 0; k < 4; ++k) {
            L[k] = mx[k];
            R[k] = mn[k];
            if ((L[k] % 2 + 2) % 2 != r) ++L[k];
            if ((R[k] % 2 + 2) % 2 != r) --R[k];
          }
          if (L[0] > R[0] || L[1] > R[1] || L[2] > R[2] || L[3] > R[3]) continue;
          if (L[0] + L[1] + L[2] > R[3] || R[0] + R[1] + R[2] < L[3]) continue;
          if (L[0] + L[1] + L[2] < L[3]) {
            int64 gap = L[3] - (L[0] + L[1] + L[2]);
            for (int k = 0; k < 3; ++k) {
              int64 used = min(R[k] - L[k], gap);
              L[k] += used;
              gap -= used;
            }
          }
          ret = {(L[1] + L[2]) / 2, (L[0] + L[2]) / 2, (L[0] + L[1]) / 2};
          found = 1;
        }
        if (!found) ok = 0;
      }
      if (!ok) {
        low = mid + 1;
      } else {
        high = mid;
      }
    }
    trace(high);
    out(ret);
  }

  return 0;
}

